Secure Multi-Party Data Management

نویسنده

  • Stefan Böttcher
چکیده

As data and information is stored, combined and accessed almost everywhere, information security and privacy becomes increasingly important to companies that offer access to data. In comparison to network and hardware security that often focus on the protection of network or hardware from attackers from the outside, information security involves protection of certain information from users that have at least some access rights ‘inside’ an information system. One key challenge in information security and privacy is to meet two contrary goals at the same time, i.e. to allow users to run applications which access the data that they need, but to prevent the same users from being able to infer sensitive information from the results returned by the application. While cryptography may be used as a supporting technology, the focus of our research at the University of Paderborn is to solve problems of information security and privacy. Our research involves different aspects of information security and privacy, e.g. access control, policies, key management, role management, inference control, detection of privacy leaks, sovereign information sharing and anonymous union computation. Although there are many great contributions to these problems by other groups in the community, within this paper, we focus on the research contributions by our group in Paderborn.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Changing Neighbors k Secure Sum Protocol for Secure Multi Party Computation

Secure sum computation of private data inputs is an important component of Secure Multi-party Computation (SMC).In this paper we provide a protocol to compute the sum of individual data inputs with zero probability of data leakage. In our proposed protocol we break input of each party into number of segments and change the arrangement of the parties such that in each round of the computation th...

متن کامل

Secure Multi-Agent Computations

We propose a security model for open multi-agent systems. Given a user-defined task T , we generate a group of mobile agents which realise a common functionality that solves T . Those agents cooperate with each other and build an autonomous community. Using a scheme for secure distributed computations, this community is able to perform secure computations without requiring interaction with a tr...

متن کامل

Secure multi-party data analysis: end user validation and practical experiments

Research papers on new secure multi-party computation protocols rarely confirm the need for the developed protocol with its end users. One challenge in the way of such validation is that it is hard to explain the benefits of secure multi-party computation to non-experts. We present a method that we used to explain the application models of secure multi-party computation to a diverse group of en...

متن کامل

Deploying secure multi-party computation for financial data analysis

In this paper we describe a secure system for jointly collecting and analyzing financial data for a consortium of ICT companies. To guarantee each participant’s privacy, we use secret sharing and secure multi-party computation (MPC) techniques. While MPC has been used to solve real-life problems beforehand, this is the first time where the actual MPC computation on real data was done over the i...

متن کامل

Quorum-Based Secure Multi-party Computation

This paper describes efficient protocols for multi-party computations that are information-theoretically secure against passive attacks. The results presented here apply to access structures based on quorum systems, which are collections of sets enjoying a naturallymotivated self-intersection property. Quorum-based access structures include threshold systems but are far richer and more general,...

متن کامل

A Distributed k-Secure Sum Protocol for Secure Multi-Party Computations

Secure sum computation of private data inputs is an interesting example of Secure Multiparty Computation (SMC) which has attracted many researchers to devise secure protocols with lower probability of data leakage. In this paper, we provide a novel protocol to compute the sum of individual data inputs with zero probability of data leakage when two neighbor parties collude to know the data of a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006